A Hole-Filling Algorithm for Triangular Meshes Using Local Radial Basis Function

نویسندگان

  • John Willian Branch
  • Flavio Prieto
  • Pierre Boulanger
چکیده

Creating models of real objects is a complex task for which the use of traditional modeling techniques has proven to be difficult. To solve some of the problem encountered, laser rangefinders are frequently used to sample an object ́s surface from several viewpoints resulting in a set of range images that are registered and integrated into a final triangulated model. In practice, due to surface reflectance properties, occlusions and accessibility limitations, certain areas of the object ́s surface are not sampled leaving holes which create undesirable artifacts in the integrated model. In this paper, we present a novel algorithm for the automatic hole–filling of triangulated models. The algorithm starts by locating hole boundary regions. A hole consists of a closed path of edges of boundary triangles that have at least an edge, which is not shared with any other triangle. The edge of the hole is then fitted with a b-spline where the average variation of the torsion of the b-spline approximation is calculated. Using a simple threshold of the average variation of the torsion along the edge, one can automatically classify real holes from man-made holes. Following this classification process, we then use an automated version of a radial basis function interpolator to fill the inside of the hole using neighboring edges. Excellent experimental results are presented. 412 J. Branch et al.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Filling Holes in Triangular Meshes in Engineering

In this paper, a novel hole-filling algorithm for triangular meshes is proposed. Firstly, the hole is triangulated into a set of new triangles using modified principle of minimum angle. Then the initial patching mesh is refined according to the density of vertices on boundary edges. Finally, the patching mesh is optimized via the bilateral filter to recover missed features. Experimental results...

متن کامل

Minimum Surface Area Based Complex Hole Filling Algorithm of 3D Mesh

Filling holes of 3D models is an important and complicated process. In this paper, we introduce a new and robust method for filling complex holes in triangular mesh models. In order to fill separate holes, the boundary edges of a hole are smoothly arranged and then locally uniform new points are added to the hole. The new points are selected by minimizing a hole filling area. The Delaunay trian...

متن کامل

A Hole-Filling Algorithm for Triangular Meshes

Data obtained by scanning 3D models typically contains missing pieces and holes. These can be caused due to scanning artifacts or artifacts in the surface due to wear and tear. We provide a method based on the Moving Least Squares projection to fill holes in triangular meshes obtained during the process of surface reconstruction . Our method can be applied to holes with non-planar geometry as w...

متن کامل

A new trust-region algorithm based on radial basis function interpolation

Optimization using radial basis functions as an interpolation tool in trust-region (ORBIT), is a derivative-free framework based on fully linear models to solve unconstrained local optimization, especially when the function evaluations are computationally expensive. This algorithm stores the interpolation points and function values to using at subsequent iterations. Despite the comparatively ad...

متن کامل

Optimization of infinite composite plates with quasi-triangular holes under in-plane loading

This study used particle swarm optimization (PSO) to determine the optimal values of effective design variables acting on the stress distribution around a quasi-triangular hole in an infinite orthotropic plate. These parameters were load angle, hole orientation, bluntness, fiber angle, and material properties, which were ascertained on the basis of an analytical method used by Lekhnitskii [3]. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006